From Cppreference
|
|
|
|
|
|
|
template<
class T,
class Container = std::deque<T>,
class Compare = std::less<typename Container::value_type>
> class priority_queue;
|
|
|
|
|
|
C++ Priority Queues are like queues, but the elements inside the queue are ordered by some predicate.
[edit] Member types
|
|
| Member type
| Definition
|
|
|
| container_type
| Container
|
|
|
| value_type
| Container::value_type
|
|
|
| size_type
| Container::size_type
|
|
|
| reference
| Container::reference
|
|
|
| const_reference
| Container::const_reference
|
[edit] Member functions
|
|
|
| constructs the priority_queue
(public member function)
|
|
|
|
| destructs the priority_queue
(public member function)
|
|
|
|
| assigns values to the container adaptor
(public member function)
|
Element access
|
|
|
|
| access the top element
(public member function)
|
Capacity
|
|
|
|
| checks whether the underlying container is empty
(public member function)
|
|
|
|
| returns the number of elements
(public member function)
|
Modifiers
|
|
|
|
| inserts element and sorts the underlying container
(public member function)
|
|
|
|
| constructs element in-place and sorts the underlying container
(public member function)
|
|
|
|
| removes the first element
(public member function)
|
|
|
|
| swaps the contents
(public member function)
|
Member objects
|
|
|
| c
| the underlying container
(protected member object)
|
[edit] Non-member functions
|
|
|
| specializes the std::swap() algorithm
(function template)
|
